Group-magic labelings and null sets of complete n-partite graphs with a deleted edge
نویسندگان
چکیده
Let A be a non-trivial, finitely-generated abelian group and A∗ = A\{0}. A graph is A-magic if there exists an edge labeling using elements of A∗ which induces a constant vertex labeling of the graph. In this paper, we analyze the group-magic property for complete n-partite graphs and composition graphs with deleted edges.
منابع مشابه
Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملZero-Sum Magic Labelings and Null Sets of Regular Graphs
For every h ∈ N, a graph G with the vertex set V (G) and the edge set E(G) is said to be h-magic if there exists a labeling l : E(G) → Zh\{0} such that the induced vertex labeling s : V (G) → Zh, defined by s(v) = ∑ uv∈E(G) l(uv) is a constant map. When this constant is zero, we say that G admits a zero-sum h-magic labeling. The null set of a graph G, denoted by N(G), is the set of all natural ...
متن کاملℤk-magic labellings of fans and wheels with magic value zero
Z k-magic labelings of fans and wheels with magic-value zero Abstract Let A be a non-trivial abelian group and A * = A − {0}. A graph is A-magic if there exists an edge labeling using elements of A * which induces a constant vertex labeling of the graph. For fan graphs F n and wheel graphs W n , we determine the sets of numbers k ∈ N, where F n and W n have Z k-magic labelings with magic-value 0.
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کامل(Di)graph products, labelings and related results
Gallian’s survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can also obtain enumerative results that provide lower bounds on the number of nonisomorphic labelings of a particular type. In this talk, we will focus in three of the (di)graphs p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 57 شماره
صفحات -
تاریخ انتشار 2013